首页> 外文OA文献 >Subnormality of unbounded composition operators over one-circuit directed graphs: exotic examples
【2h】

Subnormality of unbounded composition operators over one-circuit directed graphs: exotic examples

机译:无限组合算子在单回路上的次正规性   有向图:异国情调的例子

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

A recent example of a non-hyponormal injective composition operator in an$L^2$-space generating Stieltjes moment sequences, invented by three of thepresent authors, was built over a non-locally finite directed tree. The maingoal of this paper is to solve the problem of whether there exists such anoperator over a locally finite directed graph and, in the affirmative case, tofind the simplest possible graph with these properties (simplicity refers tolocal valency). The problem is solved affirmatively for the locally finitedirected graph $\mathscr G_{2,0}$, which consists of two branches and one loop.The only simpler directed graph for which the problem remains unsolved consistsof one branch and one loop. The consistency condition, the only efficient toolfor verifying subnormality of unbounded composition operators, is intensivelystudied in the context of $\mathscr G_{2,0}$, which leads to a constructivemethod of solving the problem. The method itself is partly based ontransforming the Krein and the Friedrichs measures coming either from shiftedAl-Salam-Carlitz $q$-polynomials or from a quartic birth and death process.
机译:在本人中的三位作者发明的,在L ^ 2 $-空间中产生Stieltjes矩序列的非伪正规内射合成算子的最新例子是建立在非局部有限有向树上的。本文的主要目标是解决在局部有限的有向图上是否存在这样的算子的问题,在肯定的情况下,找到具有这些属性的最简单图(简单性是指局部化合价)。对于局部有限向图$ \ mathscr G_ {2,0} $肯定地解决了该问题,该图由两个分支和一个循环组成。唯一尚未解决问题的较简单的有向图由一个分支和一个循环组成。在$ \ mathscr G_ {2,0} $的上下文中,深入研究了一致性条件,这是验证无界组合算子的次正规性的唯一有效工具,这导致了一种解决问题的建设性方法。该方法本身部分基于对Kerin和Friedrichs测度的转换,这些测度来自移位的Al-Salam-Carlitz $ q $多项式或四次生死过程。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号